منابع مشابه
Causal commutative arrows revisited Causal commutative arrows revisited
Causal commutative arrows (CCA) extend arrows with additional constructs and laws that make them suitable for modelling domains such as functional reactive programming, differential equations and synchronous dataflow. Earlier work has revealed that a syntactic transformation of CCA computations into normal form can result in significant performance improvements, sometimes increasing the speed o...
متن کاملNO : 4 TITLE : ‘ COMMUTATIVE ORDERS REVISITED ’ AUTHOR ( S ) : Professor Victoria Gould
This article studies commutative orders, that is, commutative semigroups having a semigroup of quotients. In a commutative order S, the square-cancellable elements S(S) constitute a well-behaved separable subsemigroup. Indeed, S(S) is also an order and has a maximum semigroup of quotients R, which is Clifford. We present a new characterisation of commutative orders in terms of semilattice decom...
متن کاملStrongly Homotopy-Commutative Monoids Revisited
We prove that the delooping, i. e., the classifying space, of a grouplike monoid is an H-space if and only if its multiplication is a homotopy homomorphism, extending and clarifying a result of Sugawara. Furthermore it is shown that the Moore loop space functor and the construction of the classifying space induce an adjunction of the according homotopy categories. 2000 Mathematics Subject Class...
متن کاملA Poset Classifying Non-commutative Term Orders
We study a poset N on the free monoid X∗ on a countable alphabet X. This poset is determined by the fact that its total extensions are precisely the standard term orders on X ∗. We also investigate the poset classifying degree-compatible standard term orders, and the poset classifying sorted term orders. For the latter poset, we give a Galois coconnection with the Young lattice.
متن کاملDerivational Complexity of Knuth-Bendix Orders Revisited
We study the derivational complexity of rewrite systems R compatible with KBO, if the signature of R is in nite. We show that the known bounds on the derivation height are preserved, if R ful ls some mild conditions. This allows us to obtain bounds on the derivational height of non simply terminating TRSs. Furthermore, we re-establish the 2-recursive upper-bound on the derivational complexity o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Semigroup Forum
سال: 2014
ISSN: 0037-1912,1432-2137
DOI: 10.1007/s00233-014-9568-1